A simple modal logic for belief revision: Extended Abstract
نویسنده
چکیده
The notions of static belief and of belief revision have been extensively studied in the literature. However, there is a surprising lack of uniformity in the two approaches. In the philosophy and logic literature the notion of static belief has been studied mainly within the context of modal logic. On the syntactic side a belief operator B is introduced, with the intended interpretation of B as the individual believes that . Various properties of beliefs are then expressed by means of axioms, such as the positive introspection axiom B ! BB , which says that if the individual believes then she believes that she believes . On the semantic side Kripke structures are used, consisting of a set of states (or possible worlds) together with a binary relation B on , with the interpretation of B as at state the individual considers state possible. The connection between syntax and semantics is then obtained by means of a valuation V which associates with every atomic sentence p the set of states where p is true. The pair h ;Bi is called a frame and the addition of a valuation V to a frame yields a model. Rules are given for determining the truth of an arbitrary formula at every state of a model; in particular, the formula B is true at state if and only if is true at every such that B , that is, if is true at every state that the individual considers possible at . A property of the accessibility relation B is said to correspond to an axiom if every instance of the axiom is true at every state of every model based on a frame that satis es the property and vice versa. The AGM theory of belief revision, on the other hand, has followed a di¤erent path. In this literature beliefs are modeled as sets of formulas in a given syntactic language and the problem that has been studied is how a belief set ought to be modi ed when new information, represented by a formula , becomes available. With a few exceptions, the tools of modal logic have not been explicitly employed in the analysis of belief revision. In the economics and game theory literature, it is standard to represent
منابع مشابه
Belief Change in Branching Time: AGM-consistency and Iterated Revision
We study belief change in the branching-time structures introduced in [4]. First, we identify a property of branching-time frames that is equivalent to AGM-consistency, which is defined as follows. A frame is AGM-consistent if the partial belief revision function associated with an arbitrary state-instant pair and an arbitrary model based on that frame can be extended to a full belief revision ...
متن کاملA simple modal logic for belief revision
We propose a modal logic based on three operators, representing intial beliefs, information and revised beliefs. Three simple axioms are used to provide a sound and complete axiomatization of the qualitative part of Bayes’ rule. Some theorems of this logic are derived concerning the interaction between current beliefs and future beliefs. Information flows and iterated revision are also discussed.
متن کاملBelief Change: from Situation Calculus to Modal Logic
We propose a translation into Modal Logic of the ideas that formalise belief change in the Situation Calculus. This translation is extended to the case of revision. In the conclusion is presented a set of open issues.
متن کاملDynamic logic for belief revision
We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result....
متن کاملSolovay-Type theorems for circular Definitions
We present an extension of the basic revision theory of circular definitions with a unary operator, 2. We present a Fitch-style proof system that is sound and complete with respect to the extended semantics. The logic of the box gives rise to a simple modal logic, and we relate provability in the extended proof system to this modal logic via a completeness theorem, using interpretations over ci...
متن کامل